Iterative Algorithm for Data Hiding in Images

نویسندگان

  • Ankur Datta
  • John J. Leeson
چکیده

The goal of steganography is to hide the existence of secret communication between the two parties. The message to be transmitted has no relationship to the cover image and the only role the cover image plays is that of a foreign message carrier. The content of the cover image has no value to the sender or the decoder. Non-native data embedding always introduces distortion. Ideally the distortion produced should be as small as possible. Usually various statistical and human perception models are used to test the level of distortion present in an image.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Application of modified balanced iterative reducing and clustering using hierarchies algorithm in parceling of brain performance using fMRI data

Introduction: Clustering of human brain is a very useful tool for diagnosis, treatment, and tracking of brain tumors. There are several methods in this category in order to do this. In this study, modified balanced iterative reducing and clustering using hierarchies (m-BIRCH) was introduced for brain activation clustering. This algorithm has an appropriate speed and good scalability in dealing ...

متن کامل

New approach for attenuation correction in SPECT images, using linear optimization

Background: Photon attenuation as an inevitable physical phenomenon influences on the diagnostic information of SPECT images and results to errors in accuracy of quantitative measurements. This can be corrected via different physical or mathematical approaches. As the correction equation in mathematical approaches is nonlinear, in this study a new method of linearization called ‘Piece ...

متن کامل

Optimizing image steganography by combining the GA and ICA

In this study, a novel approach which uses combination of steganography and cryptography for hiding information into digital images as host media is proposed. In the process, secret data is first encrypted using the mono-alphabetic substitution cipher method and then the encrypted secret data is embedded inside an image using an algorithm which combines the random patterns based on Space Fillin...

متن کامل

Data Hiding Method Based on Graph Coloring and Pixel Block‘s Correlation in Color Image

An optimized method for data hiding into a digital color image in spatial domainis provided. The graph coloring theory with different color numbers is applied. To enhance thesecurity of this method, block correlations method in an image is used. Experimental results showthat with the same PSNR, the capacity is improved by %8, and also security has increased in themethod compared with other meth...

متن کامل

Introducing an algorithm for use to hide sensitive association rules through perturb technique

Due to the rapid growth of data mining technology, obtaining private data on users through this technology becomes easier. Association Rules Mining is one of the data mining techniques to extract useful patterns in the form of association rules. One of the main problems in applying this technique on databases is the disclosure of sensitive data by endangering security and privacy. Hiding the as...

متن کامل

A survey on digital data hiding schemes: principals, algorithms, and applications

This paper investigates digital data hiding schemes. The concept of information hiding will be explained at first, and its traits, requirements, and applications will be described subsequently. In order to design a digital data hiding system, one should first become familiar with the concepts and criteria of information hiding. Having knowledge about the host signal, which may be audio, image, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002